A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
نویسنده
چکیده
Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges between the signer and the user or are limited to issue only logarithmically many signatures in terms of a security parameter. This paper presents an efficient blind signature scheme that allows a polynomial number of signatures to be securely issued while only three data exchanges are needed. Its security is proven in the random oracle model. As an application, a provably secure solution for double-spender-traceable e-cash is presented.
منابع مشابه
Ecient Blind and Partially Blind Signatures without Random Oracles
This paper proposes a new ecient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more eective in many applications (e.g., blind signatures, group signatures, anonymous credentials etc.) than the existing secure signature schemes in the standard model. As typical applications of our signature scheme, this p...
متن کاملEfficient Blind and Partially Blind Signatures Without Random Oracles
This paper proposes a new ecient signature scheme from bilinear maps that is secure in the standard model (i.e., without the random oracle model). Our signature scheme is more eective in many applications (e.g., blind signatures, group signatures, anonymous credentials etc.) than the existing secure signature schemes in the standard model such as the Boneh-Boyen [6], Camenisch-Lysyanskaya [10],...
متن کاملRound Optimal Blind Signatures
Constructing round-optimal blind signatures in the standard model has been a long standing open problem. In particular, Fischlin and Schröder recently ruled out a large class of three-move blind signatures in the standard model (Eurocrypt’10). In particular, their result shows that finding security proofs for the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the s...
متن کاملStrengthened Security for Blind Signatures
Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. More recently, a new approach to achieve some kind of provable security was explored using the so-called “random oracle model”. Last year, Stern and the author studied the security of blind signatures in this model. We first defi...
متن کاملA Practical Multivariate Blind Signature Scheme
Multivariate Cryptography is one of the main candidates for creating post-quantum cryptosystems. Especially in the area of digital signatures, there exist many practical and secure multivariate schemes. However, there is a lack of multivariate signature schemes with special properties such as blind, ring and group signatures. In this paper, we propose a technique to transform the Rainbow multiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001